package com.wyx.suanfa;

/**
 * @author 王艺锡
 * @version 1.0
 */
public class lowestCommonAncestor {
    //给定一个二叉树, 找到该树中两个指定节点的最近公共祖先。
    public static void main(String[] args) {


    }
}
/*
* class Solution {
    public TreeNode lowestCommonAncestor(TreeNode root, TreeNode p, TreeNode q) {
        if(root == q || root == p || root == null){
            return root;
        }
        TreeNode left = lowestCommonAncestor(root.left,p,q);
        TreeNode right = lowestCommonAncestor(root.right,p,q);
        if(left != null && right != null){
            return root;
        }else if(left != null && right == null){
            return left;
        }else if(left == null && right != null){
            return right;
        }else{
            return null;
        }



    }
}*/
